Deduction-based Region-Use Planning

نویسندگان

  • Robin S. Stanton
  • Hugh G. Mackenzie
چکیده

This paper describes a deductive approach to "region use" planning problems. The planning task is viewed as one of devising a complete set of policy rules by iteratively modifying the rules and making their deductive consequences readily available to the planner. The application of this approach to a National Park region zoning problem is also described. Central to the system are the representation of management policy as knowledge based rules and the detection of inconsistencies in the rules. The implementation of the system has three closely coupled components; a spatial database, an interactive graphics server and the deduction subsystem. The last of these is briefly described in the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic-Based Approaches to Intention Recognition

In this paper we discuss intention recognition in general, and the use of logic-based formalisms, and deduction and abduction in particular. We consider the relationship between causal theories used for planning and the knowledge representation and reasoning used for intention recognition. We look at the challenges and the issues, and we explore eight case studies.

متن کامل

Explanatory Text Planning In Logic Based Systems

This paper discusses aspects of the planning of explanatory texts for logic based systems. It presents a method for deriving Natural Language text plans from Natural Deduction-based structures. This approach allows for the planning of explanatory texts in a general-purpose logic based system framework, ensuring a greater degree of portability across domains.

متن کامل

Planning as Satissability

We develop a formal model of planning based on satissability rather than deduction. The satissability approach not only provides a more ex-ible framework for stating diierent kinds of constraints on plans, but also more accurately reeects the theory behind modern constraint-based planning systems. Finally, we consider the computational characteristics of the resulting formulas, by solving them ...

متن کامل

Deduction-Based Refinement Planning

We introduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmement proceeds by stepwise transforming nonconstructive problem specifications into executable plans. For each refinement step there is a correctness proof guaranteeing the soundness of refinement and with that the generation of provably correct plans. By solvi...

متن کامل

Deduction-based Reenement Planning

We introduce a method of deduction-based re-nement planning where prefabricated general solutions are adapted to special problems. Re-nement proceeds by stepwise transforming non-constructive problem speciications into exe-cutable plans. For each reenement step there is a correctness proof guaranteeing the soundness of reenement and with that the generation of prov-ably correct plans. By solvin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987